From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata

نویسندگان

چکیده

Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into deterministic parity automaton (DPA) by means of Safra-Piterman construction. One challenges size DPA, which often grows very fast in practice, and can reach double exponential length formula. In this paper, we describe single translation from limit-deterministic Büchi automata (LDBA) to DPA show that it be concatenated with recent efficient translations LDBA yield exponential, ‘Safraless’ LTL-to-DPA We also report on an implementation comparison other several sets formulas literature.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata

Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL fo...

متن کامل

Complementing Semi-deterministic Büchi Automata

We introduce an efficient complementation technique for semi-deterministic Büchi automata, which are Büchi automata that are deterministic in the limit: from every accepting state onward, their behaviour is deterministic. It is interesting to study semi-deterministic automata, because they play a role in practical applications of automata theory, such as the analysis of Markov decision processe...

متن کامل

Converting Linear Temporal Logic to Deterministic (Generalised) Rabin Automata

Recently a new method directly translating linear temporal logic (LTL) formulas to deterministic (generalized) Rabin automata was proposed by Javier Esparza and Jan Kret́ınský [1]. Compared to the existing approaches of constructing a non-deterministic Buechi-automaton in the first step and then applying a determinization procedure (e.g. some variant of Safra’s construction) in a second step, th...

متن کامل

MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata

The limiting factor for quantitative analysis of Markov decision processes (MDP) against specifications given in linear temporal logic (LTL) is the size of the generated product. As recently shown, a special subclass of limit-deterministic Büchi automata (LDBA) can replace deterministic Rabin automata in quantitative probabilistic model checking algorithms. We present an extension of PRISM for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal on Software Tools for Technology Transfer

سال: 2022

ISSN: ['1433-2779', '1433-2787']

DOI: https://doi.org/10.1007/s10009-022-00663-1